A nearly best-possible approximation algorithm for node-weighted Steiner trees
نویسندگان
چکیده
We give the rst approximation algorithm for the node-weighted Steiner tree problem. Its performance guarantee is within a constant factor of the best possible unless ~ P NP. Our algorithm generalizes to handle other network design problems.
منابع مشابه
Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets
A greedy approximation algorithm based on \spider decompositions" was developed by Klein and Ravi for node weighted Steiner trees. This algorithm provides a worst case approximation ratio of 2 lnk, where k is the number of terminals. However, the best known lower bound on the approximation ratio is lnk, assuming that NP 6 DTIME[n ], by a reduction from set cover [9, 4]. We show that for the unw...
متن کاملCs 598csc: Approximation Algorithms
There are many applications of the tree embedding theorem in approximation and online algorithms. It allows one to reduce certain class of problems on graphs to problems on trees and it is much easier to design algorithms on trees. The ratio one obtains using this approach might not be optimal but gives one a quick upper bound on the approximation ratio. For some problems this is still the best...
متن کاملA (4 + ǫ)-Approximation for the Minimum-Weight Dominating Set Problem in Unit Disk Graphs
We present a (4 + ǫ)-approximation algorithm for the problem of computing a minimum-weight dominating set in unit disk graphs, where ǫ is an arbitrarily small constant. The previous best known approximation ratio was 5+ǫ. The main result of this paper is a 4-approximation algorithm for the problem restricted to constant-size areas. To obtain the (4 + ǫ)-approximation algorithm for the unrestric...
متن کاملApproximation Algorithms for Node-Weighted Prize-Collecting Steiner Tree Problems on Planar Graphs
Abstract. We study the prize-collecting version of the Node-weighted Steiner Tree problem (NWPCST) restricted to planar graphs. We give a new primal-dual Lagrangian-multiplier-preserving (LMP) 3-approximation algorithm for planar NWPCST. We then show a (2.88+ǫ)-approximation which establishes a new best approximation guarantee for planar NWPCST. This is done by combining our LMP algorithm with ...
متن کاملBest possible bounds for the weighted path length of optimum binary search trees
We derive upper and lower bounds for the weighted path length P opt of optimum binary search trees. In particular, I/Iog3 H S Popt ~ 2 + H where H is the entropy of the frequency distribution. We also present an approximation algorithm which constructs nearly optimal trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Algorithms
دوره 19 شماره
صفحات -
تاریخ انتشار 1993